Accumulator Aided Decoding of Low Complexity SISO Arithmetic Codes with Image Transmission Application
نویسندگان
چکیده
In this paper, we address Joint Source-Channel (JSC) decoding with low decoding complexity over wireless channel. We propose a unity rate accumulator based design for soft-input soft-out decoding for low complexity Chase-like decoding of arithmetic codes. Chase-like decoding is a low complexity algorithm, where a maximum a posteriori sequence estimation criterion is employed for maximum likelihood decoding of variable length codes like arithmetic codes. Previous contributions propose iterative decoding SISO arithmetic codes with convolutional codes and LDPC codes. We propose application of unity rate accumulator as inner encoder and decoder in the system, which improves the bit error performance of the system by 1. 25 dB with same number of decoding iterations. We evaluate the performance of the proposed scheme for image transmission application.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملJoint source/channel iterative arithmetic decoding with JPEG2000 image transmission application
Motivated by recent results in Joint Source/Channel coding and decoding, we consider the decoding problem of Arithmetic Codes (AC). In fact, in this article we provide different approaches which allow one to unify the arithmetic decoding and error correction tasks. A novel length-constrained arithmetic decoding algorithm based on Maximum A Posteriori sequence estimation is proposed. The latter ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملError correction by means of arithmetic codes: an application to resilient image transmission
In this paper, two novel maximum a posteriori (MAP) estimators for the decoding of arithmetic codes in the presence of transmission errors are presented. Trellis search techniques and a forbidden symbol are employed to obtain forward error correction. The proposed system is applied to lossless image compression and transmission across the BSC; the results are compared in terms of both performan...
متن کاملHigh-performance, low-complexity decoding of generalized low-density parity-check codes
A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager’s Low-Density ParityCheck (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individu...
متن کامل